Verilog Implementation of a System for Finding Shortest Path by Using Bellman Ford Algorithm

There exit several high speed computation applications that requires minimum distance computation between nodes in weighted graph. Dedicated techniques exist for this purpose are called as shortest path computation. Depending upon need of application, there are three type of shortest path problems; Single Source Shortest Path (SSSP), Single Destination Shortest Path (SDSP) and All Pair Shortest Path (APSP). For Single source shortest path computation Bellman Ford Algorithm provides most efficient results. This paper present verilog implementation of Bellman Ford algorithm for determination of shortest path between one node to all other nodes of graph. This implementation leads to the hardware implementation of Bellman ford algorithm which is not possible with existing implementation.